A Novel Approach for Computing Dynamic Slices of Aspect-Oriented Programs
نویسندگان
چکیده
We propose a dynamic slicing algorithm to compute the slices of aspect-oriented programs. We use a dependence based intermediate program representation called Aspect System Dependence Graph (AOSG) to represent aspect-oriented programs. Then, we propose the dynamic slicing algorithm for AOPs, which is an extended version of EMDS algorithm for object-oriented programs. Our algorithm is based on marking and unmarking of the edges of AOSG appropriately during runtime. Keywords-Aspect-oriented Programming; Aspect-oriented System Dependence Graph; Aspect; System Dependence Graph; Slice
منابع مشابه
Slicing Aspect-oriented program Hierarchically
While developing a software system, the complexity in describing a problem should be reduced. This can be done by separating the concern in a clean and explicit way. Each of the concern can be addressed by partitioning a software system into modules. Concerns are clearly identifiable with a special linguistic construct called Aspects, which has been introduced by a new programming paradigm know...
متن کاملAn Approach for Computing Dynamic Slice of Concurrent Aspect-Oriented Programs
We propose a dynamic slicing algorithm to compute the slice of concurrent aspect-oriented programs. We use a dependence based intermediate program representation called Concurrent Aspect-oriented System Dependence Graph (CASDG) to represent a concurrent aspect-oriented program. The CASDG of an aspect-oriented program consists of a system dependence graph (SDG) for the non-aspect code, a group o...
متن کاملComputing Dynamic Slices of Object-Oriented Programs using Dependency Information
Now a days, object-oriented programs are becoming very popular amongst the developers and hence almost all software are designed using the object-oriented paradigm. Advanced features of object-oriented programming has made it complicated to understand, test, debug and maintain. To better manage these software, slicing techniques have been proved to be quite efficient. This paper proposed an alg...
متن کاملMeasurement of Dynamic Metrics Using Dynamic Analysis of Programs
Dynamic analysis of programs is a prerequisite for the measurement of dynamic metrics. Dynamic analysis of an application involves the collection of run-time data from the run-time profiles or from dynamic models of the software system. Dynamic analysis is more precise specially in handling object-oriented features like inheritance, polymorphism, etc but is at the same time, slow and complex pr...
متن کاملDynamic Graph Based Slicing for Object-oriented Programs
This paper proposes a Dynamic Graph (DG) traversal slicing algorithm for computing dynamic slices of object-oriented programs in presence of inheritance. The computed dynamic slice can facilitate various software engineering activities like program comprehension, testing, debugging, reverse engineering maintenance etc. This paper first proposes an intermediate program Dynamic Graph (DG) to repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.0100 شماره
صفحات -
تاریخ انتشار 2012